Self-Correcting Unsound Reasoning Agents

نویسنده

  • Yannick Chevalier
چکیده

This paper introduces a formal framework for relating learning and deduction in reasoning agents. Our goal is to capture imperfect reasoning as well as the progress, through introspection, towards a better reasoning ability. We capture the interleaving between these by a reasoning/deduction connection and we show how this—and related—definition apply to a setting in which agents are modeled by first-order logic theories. In this setting, we give a sufficient condition on the connection ensuring that under fairness assumptions the limit of introspection steps is a sound and complete deduction system. Under the same assumption we prove every falsehood is eventually refuted, hence the self-correction property.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Is Intractability of Non-Monotonic Reasoning a Real

Several studies about complexity of NMR showed that inferring in non-monotonic knowledge bases is significantly harder than reasoning in monotonic ones. This contrasts with the general idea that NMR can be used to make knowledge representation and reasoning simpler, not harder. In this paper we show that, to some extent, NMR has fulfilled its goal. In particular we prove that circumscription al...

متن کامل

Improving Agent Performance for Multi-Resource Negotiation Using Learning Automata and Case-Based Reasoning

In electronic commerce markets, agents often should acquire multiple resources to fulfil a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. In recent ...

متن کامل

A Proposal for Weak-Memory Local Reasoning

Program logics are formal systems for specifying and reasoning about software programs. Most program logics make the strong assumption that all threads agree on the value of shared memory at all times. This assumption can be unsound though for programs with races, like many concurrent data structures. Verification of these difficult programs must take into account the weaker models of memory pr...

متن کامل

Complete Classification of Complex ALCHO Ontologies Using a Hybrid Reasoning Approach

Consequence-based reasoners are typically significantly faster than tableau-based reasoners for ontology classification. However, for more expressive DL languages like ALCHO, consequence-based reasoners are not applicable, but tableau-based reasoners can sometimes require an unacceptably long time for large and complex ontologies. This paper presents a weakening and strengthening approach for c...

متن کامل

Sound Summarizations for Alchi Ontologies - How to Speedup Instance Checking and Instance Retrieval

In the last years, the vision of the Semantic Web fostered the interest in reasoning over ever larger sets of assertional statements in ontologies. In this senario, state-of-the-art description logic reasoning systems cannot deal with real-world ontologies any longer, since they rely on in-memory structures. In these scenarios it will become more important to rely on unsound or incomplete reaso...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017